A fast and accurate algorithm for solving Bernstein–Vandermonde linear systems
نویسنده
چکیده
A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville elimination. The use of explicit expressions for the determinants involved in the process serves to make the algorithm both fast and accurate.
منابع مشابه
Ela Accurate Computations with Totally Positive Bernstein–vandermonde Matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملAccurate computations with totally positive Bernstein-Vandermonde matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملAccurate numerical linear algebra with Bernstein–Vandermonde matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein-Vandermonde matrix is considered. Bernstein-Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملA fast Björck-Pereyra-like algorithm for solving quasiseparable- Hessenberg-Vandermonde systems
In this paper we derive a fast O(n) algorithm for solving linear systems where the coefficient matrix is a polynomial-Vandermonde VR(x) = [rj−1(xi)] matrix with polynomials R related to a quasiseparable matrix. The result is a generalization of the well-known Björck-Pereyra algorithm for classical Vandermonde systems. As will be shown, many important systems of polynomials are related to quasis...
متن کاملDisplacement Structure Approach to Polynomial Vandermonde and Related Matrices
In this paper we introduce a new class of what we shall call polynomial Vandermonde-like matrices. This class generalizes the polynomial Vandermonde matrices studied earlier by various authors, who derived explicit inversion formulas and fast algorithms for inversion and for solving the associated linear systems. A displacement structure approach allows us to carry over all these results to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006